A Testing Read-Once Formula Satisfaction
نویسندگان
چکیده
We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in , doubly exponential in the arity, and independent of all other parameters. When the gates are limited to being monotone, we prove that there is an estimation algorithm, that outputs an approximation of the distance of the input from satisfying the property. For formulas only involving And/Or gates, we provide a more efficient test whose query complexity is only quasipolynomial in . On the other hand, we show that such testability results do not hold in general for formulas over non-Boolean alphabets; specifically we construct a property defined by a read-once arity 2 (non-Boolean) formula over an alphabet of size 4, such that any 1/4-test for it requires a number of queries depending on the formula size. We also present such a formula over an alphabet of size 5 that additionally satisfies a strong monotonicity condition.
منابع مشابه
Testing Formula Satisfaction
We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in ǫ, doubly exponential in the arity, an...
متن کاملComplete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+,×} and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box set...
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کاملA Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials
The polynomial identity testing problem, or PIT, asks how we can decide if a polynomial is equivalent to zero. A read-once polynomial (ROP) is a polynomial over some field that can be expressed with an arithmetic formula where each variable appears at most once. We construct a deterministic polynomial time algorithm for identity testing a black-box ROP. In particular, we show that for a read-on...
متن کاملOn Reconstruction and Testing of Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+,×} and each input variable labels at most one leaf. A preprocessed ROF (PROF for short) is a ROF in which we are allowed to replace each variable xi with a univariate polynomial Ti(xi). We obtain a deterministic non-adaptive reconstruction algorithm for PROFs,...
متن کامل